Definable isomorphism problem
نویسندگان
چکیده
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying structure of atoms, we prove decidability of the problem. The core result is parameter-elimination: existence of an isomorphism definable with parameters implies existence of an isomorphism definable without parameters.
منابع مشابه
On the First-Order Complexity of Induced Subgraph Isomorphism
Given a graph F , let I(F ) be the class of graphs containing F as an induced subgraph. Let W [F ] denote the minimum k such that I(F ) is definable in k-variable first-order logic. The recognition problem of I(F ), known as Induced Subgraph Isomorphism (for the pattern graph F ), is solvable in time O(nW [F ]). Motivated by this fact, we are interested in determining or estimating the value of...
متن کاملDefinability in Substructure Orderings, II: Finite Ordered Sets
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite poset P , the set {p, p} is definable, where p and p are the isomorphism types of P and its dual poset. We prove that the only non-identity automorphism of P is the duality ...
متن کاملChoiceless Polynomial Time on Structures with Small Abelian Colour Classes
Choiceless Polynomial Time (CPT) is one of the candidates in the quest for a logic for polynomial time. It is a strict extension of fixed-point logic with counting (FPC) but to date it is unknown whether it expresses all polynomial-time properties of finite structures. We study the CPT-definability of the isomorphism problem for relational structures of bounded colour class size q (for short, q...
متن کاملDefinable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that this reduction can be done in fixed-point logic with counting (FPC) for linear and semidefinite programs applies to any family of explicitly bounded convex ...
متن کاملOn Supersimple Groups
An infinite group with supersimple theory has a finite series of definable groups whose factors are infinite and either virtually-FC or virtuallysimple modulo a finite FC-centre. We deduce that a group which is typedefinable in a supersimple theory has a finite series of relatively definable groups whose factors are either abelian or simple groups. In this decomposition, the non-abelian simple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.08500 شماره
صفحات -
تاریخ انتشار 2018